<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>cache on 造舟野渡</title>
    <link>http://thoreauz.com/tags/cache/</link>
    <description>Recent content in cache on 造舟野渡</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>zh_CN</language>
    <copyright>All rights reserved - 2017</copyright>
    <lastBuildDate>Thu, 08 Feb 2018 22:30:58 +0000</lastBuildDate><atom:link href="http://thoreauz.com/tags/cache/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>聊聊本地缓存</title>
      <link>http://thoreauz.com/2018/02/08/local-cache/</link>
      <pubDate>Thu, 08 Feb 2018 22:30:58 +0000</pubDate>
      
      <guid>http://thoreauz.com/2018/02/08/local-cache/</guid>
      <description>概述 本文介绍一些常见的缓存设计算法和思路。比如缓存淘汰的算法：LRU，SLRU，LFU，W-TinyLFU。实现入guava cache和ca</description>
    </item>
    
  </channel>
</rss>
